| 翻訳と辞書 |
| Hans Bodlaender ： ウィキペディア英語版 |
Hans L. Bodlaender
Hans Leo Bodlaender (born April 21, 1960)〔(Curriculum vitae ), retrieved 2012-02-18.〕 is a Dutch computer scientist, a professor of computer science at Utrecht University. Bodlaender is known for his work on graph algorithms and in particular for algorithms relating to tree decomposition of graphs.
== Life and work ==
Born in Bennekom, Bodlaender was educated at Utrecht University, earning a doctorate in 1986 under the supervision of Jan van Leeuwen with the thesis, entitled ''Distributed Computing — Structure and Complexity.''〔〔.〕
After postdoctoral research at the Massachusetts Institute of Technology in 1987, he returned to Utrecht as a faculty member. In 1987 he was appointed Assistant Professor and in 2003 Associate Professor.〔 In 2014 he was awarded the Nerode Prize for an outstanding paper in the area of multivariate algorithmics.
Bodlaender has written extensively about chess variants and founded the website ''The Chess Variant Pages'' in 1995.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Hans L. Bodlaender」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|